Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
نویسندگان
چکیده
منابع مشابه
Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
Symbol-pair code is a new coding framework which is proposed to correct errors in the symbolpair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pairdistance five or six. ...
متن کاملMaximum distance separable codes for b-symbol read channels
Recently, Yaakobi et al. introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we establish a Singleton-type bound on b-symbol codes. Codes meeting the Singleton-type bound are called maximum distance separable (MDS) codes, and they are optimal in the sense they attain the maximal minimum bdistance. Based on...
متن کاملNew constructions of MDS symbol-pair codes
Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...
متن کاملMaximum distance separable codes and arcs in projective spaces
Given any linear code C over a finite field GF(q) we show how C can be described in a transparent and geometrical way by using the associated Bruen–Silverman code. Then, specializing to the case of MDS codes we use our new approach to offer improvements to the main results currently available concerning MDS extensions of linear MDS codes. We also sharply limit the possibilities for constructing...
متن کاملB-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0271-y